On Embeddings of l1k from Locally Decodable Codes

نویسنده

  • Jop Briët
چکیده

We show that any q-query locally decodable code (LDC) gives a copy of `1 with small distortion in the Banach space of q-linear forms on `Np1×· · ·× ` N pq , provided 1/p1 + · · ·+1/pq ≤ 1 and where k, N , and the distortion are simple functions of the code parameters. We exhibit the copies of `1 by constructing a basis directly from “smooth” LDC decoders, thus bypassing a matching lemma often used in the LDC literature. Based on this, we give alternative proofs for known lower bounds on the length of 2-query LDCs. Using similar techniques, we reprove known lower bounds for larger q. We also discuss the relation with an alternative proof, due to Pisier, of a result of Naor, Regev, and the author on cotype properties of projective tensor products of `p spaces.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Embeddings of $\ell_1^k$ from Locally Decodable Codes

We show that any q-query locally decodable code (LDC) gives a copy of l 1 with small distortion in the Banach space of q-linear forms on lNp1 ×· · ·× lNpq , provided 1/p1+ · · ·+1/pq ≤ 1 and where k, N , and the distortion are simple functions of the code parameters. We exhibit the copy of l 1 by constructing a basis for it directly from “smooth” LDC decoders. Based on this, we give alternative...

متن کامل

A Note on Amplifying the Error-Tolerance of Locally Decodable Codes

We show a generic, simple way to amplify the error-tolerance of locally decodable codes. Specifically, we show how to transform a locally decodable code that can tolerate a constant fraction of errors to a locally decodable code that can recover from a much higher error-rate. We also show how to transform such locally decodable codes to locally list-decodable codes. The transformation involves ...

متن کامل

Exponential Lower Bound for 2-Query Locally Decodable Codes

We prove exponential lower bounds on the length of 2-query locally decodable codes. Goldreich et al. recently proved such bounds for the special case of linear locally decodable codes. Our proof shows that a 2-query locally decodable code can be decoded with only 1 quantum query, and then proves an exponential lower bound for such 1-query locally quantum-decodable codes. We also exhibit q-query...

متن کامل

Locally Decodable Codes: A Brief Survey

Locally decodable codes are error correcting codes that simultaneously provide efficient random-access to encoded data and high noise resilience by allowing reliable reconstruction of an arbitrary data bit from looking at only a small number of randomly chosen codeword bits. Local decodability comes at the price of certain loss in terms of code efficiency. Specifically, locally decodable codes ...

متن کامل

Locally decodable codes

Locally decodable codes (LDCs) are error correcting codes that simultaneously provide efficient random-access to encoded data and high noise resilience by allowing reliable reconstruction of an arbitrary data bit from looking at only a small number of randomly chosen codeword bits. In this work we survey three known families of LDCs and compare their parameters.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electronic Colloquium on Computational Complexity (ECCC)

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2015